Optimal Approximation on Sd
نویسندگان
چکیده
منابع مشابه
Optimal Approximation on
The theory of functions on the two-dimensional sphere was initiated in the 18th century in the works of Laplace and Legendre. The general theory for the d-dimensional sphere was started at the beginning of this century. Due to the technical difficulties involved, the general theory is relatively incomplete, as compared to the theory of functions on the circle. We are introducing a wide range of...
متن کاملConstrained Nonlinear Optimal Control via a Hybrid BA-SD
The non-convex behavior presented by nonlinear systems limits the application of classical optimization techniques to solve optimal control problems for these kinds of systems. This paper proposes a hybrid algorithm, namely BA-SD, by combining Bee algorithm (BA) with steepest descent (SD) method for numerically solving nonlinear optimal control (NOC) problems. The proposed algorithm includes th...
متن کاملOn Optimal Finite-Difference Approximation of PML
A technique derived from two related methods suggested earlier by some of the authors for optimization of finite-difference grids and absorbing boundary conditions is applied to discretization of perfectly matched layer (PML) absorbing boundary conditions for wave equations in Cartesian coordinates. We formulate simple sufficient conditions for optimality and implement them. It is found that th...
متن کاملOn optimal approximation of orthogonal polygons
In this paper we consider the following problem in computational geometry which has applications in VLSI oorplan design and image processing. Given an orthogonal polygon P (i.e. edges are either vertical or horizontal) with n ver-tices and a positive integer m < n, determine an orthogonal polygon Q with less than or equal to m vertices such that ERROR(P; Q) is minimized, where ERROR(P; Q) is de...
متن کاملOptimal Belief Approximation
In Bayesian statistics probability distributions express beliefs. However, for many problems the beliefs cannot be computed analytically and approximations of beliefs are needed. We seek a ranking function that quantifies how “embarrassing” it is to communicate a given approximation. We show that there is only one ranking under the requirements that (1) the best ranked approximation is the non-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2000
ISSN: 0885-064X
DOI: 10.1006/jcom.2000.0543